def recursive_fibonacci(n):
    if n <= 1:
        return n
    else:
        return recursive_fibonacci(n - 1) + recursive_fibonacci(n - 2)


while 1:
    choice = input("是否开始查询：")
    if choice == "1":
        user_number = input("您想要知道多少项斐波那契数列：")
        if user_number.isdigit():
            user_number = int(user_number)
            if user_number <= 0:
                print("请输入大于0的数！")
            else:
                print("斐波那契数列:")
                for i in range(1, user_number + 1):
                    print(recursive_fibonacci(i))
        else:
            print("您的输入有误！")
    else:
        print("欢迎下次光临！")
        break
